Controlling Content Realization with Functional Unification Grammars
نویسندگان
چکیده
Standard Functional Uniication Grammars (FUGs) provide a structurally guided top-down control regime for sentence generation. When using FUGs to perform content realization as a whole, including lexical choice, this regime is no longer appropriate for two reasons: (1) the uniication of non-lexicalized semantic input with an integrated lexico-grammar requires mapping \\oating" semantic elements which can trigger extensive backtracking and (2) lexical choice requires accessing external constraint sources on demand to preserve the modularity between conceptual and linguistic knowledge. We introduce two control tools that we have implemented for FUGs to address these limitations: bk-class, a form of dependency-directed backtracking to eeciently process \\oating" constraints and external, a co-routine mechanism allowing a FUG to cooperate with external constraint sources during uniication. We show how these tools complement the top-down regime of FUGs to control the whole content realization process.
منابع مشابه
Controlling Content Realization with Functional Uniication Grammars
Standard Functional Uniication Grammars (FUGs) provide a structurally guided top-down control regime for sentence generation. When using FUGs to perform content realization as a whole, including lexical choice, this regime is no longer appropriate for two reasons: (1) the uniication of non-lexicalized semantic input with an integrated lexico-grammar requires mapping \\oating" semantic elements ...
متن کاملD-PATR: A Development Environment for Unification-Based Grammars
I)-PATR is a development environment for unification-based grammars on Xerox l i00 series work stations. It is based on the PATR formalism developed at SRI International. This formalism is suitable for encoding a wide variety of grammars. At one end of this range are simple phrase-structure grammars with no feature augmentations. The PATR formalism can also be used to encode grammars that are b...
متن کاملOn the Universal Generation Problem for Unification Grammars
The universal generation problem for unification grammars is the problem of determining whether a given grammar derives any terminal string with a given feature structure. It is known that the problem is decidable for LFG and PATR grammars if only acyclic feature structures are taken into consideration. In this brief note, we show that the problem is undecidable for cyclic structures. This hold...
متن کاملA Complete, Efficient Sentence-Realization Algorithm for Unification Grammar
This paper describes an efficient sentence-realization algorithm that is complete for a very general class of unification grammars. Under fairly modest constraints on the grammar, the algorithm is shown to be polynomial time for generation of sentences whose logical form exactly matches the goal logical form. The algorithm can be extended to handle what is arguably the most important subcase of...
متن کاملPolynomially parsable unification grammars
Unification grammars (UG) are a grammatical formalism that underlies several contemporary linguistic theories, including Lexical-functional Grammar and Head-driven Phrase-structure Grammar. UG is an especially attractive formalism because of its expressivity, which facilitates the expression of complex linguistic structures and relations. Formally, UG is Turing-complete, generating the entire c...
متن کامل